About One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions

In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimization problems encounters serious difficulties in passing through nodal points. The results are illustrated with a specific numerical example.